Laguerre-like Methods for the Simultaneous Approximation of Polynomial Multiple Zeros
نویسندگان
چکیده
Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as circular complex interval arithmetic. The derived iterative formulas are suitable for the construction of modified methods with improved convergence rate with negligible additional operations. Very fast convergence of the considered methods is illustrated by two numerical examples.
منابع مشابه
Laguerre-like Methods with Corrections for the Inclusion of Polynomial Zeros
Iterative methods of Laguerre’s type for the simultaneous inclusion of all zeros of a polynomial are proposed. Using Newton’s and Halley’s corrections, the order of convergence of the basic method is increased from 4 to 5 and 6, respectively. Further improvements are achieved by the Gauss-Seidel approach. Using the concept of the R-order of convergence of mutually dependent sequences, we presen...
متن کاملThe electrostatic properties of zeros of exceptional Laguerre and Jacobi polynomials and stable interpolation
We examine the electrostatic properties of exceptional and regular zeros of Xm-Laguerre and Xm-Jacobi polynomials. Since there is a close connection between the electrostatic properties of the zeros and the stability of interpolation on the system of zeros, we can deduce an Egerváry-Turán type result as well. The limit of the energy on the regular zeros is also investigated.
متن کاملVarying discrete Laguerre-Sobolev orthogonal polynomials: Asymptotic behavior and zeros
We consider a varying discrete Sobolev inner product involving the Laguerre weight. Our aim is to study the asymptotic properties of the corresponding orthogonal polynomials and of their zeros. We are interested in Mehler–Heine type formulas because they describe the asymptotic differences between these Sobolev orthogonal polynomials and the classical Laguerre polynomials. Moreover, they give u...
متن کاملSemilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. ...
متن کاملQuasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems
In this article, the quasi-Laguerre iteration is established in the spirit of Laguerre's iteration for solving polynomial f with all real zeros. The new algorithm, which maintains the monotonicity and global convergence of the Laguerre iteration, no longer needs to evaluate f". The ultimate convergence rate is + 1. When applied to approximate the eigenvalues of a symmetric tridiagonal matrix, t...
متن کامل